منابع مشابه
Shape Matching by Random Sampling
In order to determine the similarity between two planar shapes, which is an important problem in computer vision and pattern recognition, it is necessary to first match the two shapes as good as possible. As sets of allowed transformation to match shapes we consider translations, rigid motions, and similarities. We present a generic probabilistic algorithm based on random sampling for matching ...
متن کاملIntrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have been particularly successful due to their generality and efficiency. We introduce a new sampling-based shape matching algorithm that uses a planning step to find optimized ”landmark” points. These points are matched first...
متن کاملrecognition of handwritten farsi digits by shape matching
in this paper, we used a shape matching algorithm to recognize farsi digits. for each sampled point on the contour of a shape, we obtain a descriptor showing the distribution of the other points of the contour, with respect to this point. based on these descriptors, we find the corresponding points of the two contours and take the sum of their distances as a dissimilarity measure between two sh...
متن کاملShape Matching by Elastic Deformation
In this paper we present a new one-dimensional shape matching technique based on elastic deformation of a model or template. Deformations of the given template are introduced as a way to improve the matching with the image data. A trade-o is made between the amount of deformation and a gure of merit that accounts for the match. This approach yields a new optimization functional so that the opti...
متن کاملShape Matching by Segmentation Averaging
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our technique has many extensions, yielding new algorithms for tracking, object detection, segmentation, and edge-preserving smoothing. For segmentation, instead of a maximum a posteriori approach, we compute the “central” segmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.03.023